Semi-Simultaneous Flows and Binary Constrained (Integer) Linear Programs
نویسندگان
چکیده
Linear and integer programs are considered whose coefficient matrices can be partitioned into K consecutive ones matrices. Mimicking the special case of K = 1 which is well-known to be equivalent to a network flow problem we show that these programs can be transformed to a generalized network flow problem which we call semi-simultaneous (se-sim) network flow problem. Feasibility conditions for se-sim flows are established and methods for finding initial feasible se-sim flows are derived. Optimal se-sim flows are characterized by a generalization of the negative cycle theorem for the minimum cost flow problem. The issue of improving a given flow is addressed both from a theoretical and practical point of view. The paper concludes with a summary and some suggestions for possible future work in this area.
منابع مشابه
Security Constrained Unit Commitment in the Simultaneous Presence of Demand Response Sources and Electric Vehicles
Due to the ever-growing load, especially peak load, the increase in the capacity of plants is inevitable for the response to this growth. Peak load causes increases in customer costs and vast investments in generating and transmission parts. Therefore, restructuring in the electrical industry, competition in the electrical market and Demand Response Programs (DRPs) are of special importance in ...
متن کاملA Chance Constrained Integer Programming Model for Open Pit Long-Term Production Planning
The mine production planning defines a sequence of block extraction to obtain the highest NPV under a number of constraints. Mathematical programming has become a widespread approach to optimize production planning, for open pit mines since the 1960s. However, the previous and existing models are found to be limited in their ability to explicitly incorporate the ore grade uncertainty into the p...
متن کاملUsing Bit Representation to Improve LP Relaxations of Mixed-Integer Quadratic Programs
A standard trick in integer programming is to replace each bounded integer-constrained variable with a small number of binary variables, using the bit representation of the given variable. We show that, in the case of mixed-integer quadratic programs (MIQPs), this process can enable one to obtain stronger linear programming relaxations. Moreover, we give a simple sufficient condition under whic...
متن کاملROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS I. A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA APPROACH
This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...
متن کاملA Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs
In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N , these integer programs are polynomial-time solvable for any linear objective. Moreover, we present a polynomial-time computable optimality certificate for the case of fixed blocks, variable N and any c...
متن کامل